An approximation algorithm for the pickup and delivery vehicle routing problem on treesKATOH, Naoki; YANO, Taihei.Discrete applied mathematics. 2006, Vol 154, Num 16, pp 2335-2349, issn 0166-218X, 15 p.Conference Paper

A list heuristic for vertex coverAVIS, David; IMAMURA, Tomokazu.Operations research letters. 2007, Vol 35, Num 2, pp 201-204, issn 0167-6377, 4 p.Article

Approximation and online algorithms (Third international workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005)Erlebach, Thomas; Persinao, Giuseppe.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32207-8, 1Vol, X-347 p, isbn 3-540-32207-8Conference Proceedings

A well-characterized approximation problemHÅSTAD, J; PHILLIPS, S; SAFRA, S et al.Information processing letters. 1993, Vol 47, Num 6, pp 301-305, issn 0020-0190Article

Algorithms - ESA 2005 (13th annual European sympoisum, Palma de Mallorca, Sapin, October 3-6, 2005, proceedings)Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-29118-0, 1Vol, XVIII, 901 p, isbn 3-540-29118-0Conference Proceedings

Improved approximation algorithm for the feedback set problem in a bipartite tournamentSASATTE, Prashant.Operations research letters. 2008, Vol 36, Num 5, pp 602-604, issn 0167-6377, 3 p.Article

A note on the approximability of cutting stock problems : Cutting and PackingCINTRA, G. F; MIYAZAWA, F. K; WAKABAYASHI, Y et al.European journal of operational research. 2007, Vol 183, Num 3, pp 1328-1332, issn 0377-2217, 5 p.Article

On the intercluster distance of a tree metricBANG YE WU.Theoretical computer science. 2006, Vol 369, Num 1-3, pp 136-141, issn 0304-3975, 6 p.Article

Maximum Series-Parallel SubgraphCALINESCU, Gruia; FERNANDES, Cristina G; KAUL, Hemanshu et al.Algorithmica. 2012, Vol 63, Num 1-2, pp 137-157, issn 0178-4617, 21 p.Article

Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l_∞-Fitting Robinson Structures to DistancesCHEPOI, Victor; SESTON, Morgan.Algorithmica. 2011, Vol 59, Num 4, pp 521-568, issn 0178-4617, 48 p.Article

A metric for rooted trees with unlabeled vertices based on nested parenthesesWU, Chan-Shuo; HUANG, Guan-Shieng.Theoretical computer science. 2010, Vol 411, Num 44-46, pp 3923-3931, issn 0304-3975, 9 p.Article

A better differential approximation ratio for symmetric TSPESCOFFIER, Bruno; MONNOT, Jérome.Theoretical computer science. 2008, Vol 396, Num 1-3, pp 63-70, issn 0304-3975, 8 p.Article

Asymmetry in k-center variantsGØRTZ, Inge Li; WIRTH, Anthony.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 188-199, issn 0304-3975, 12 p.Article

Approximating the balanced minimum evolution problemFIORINI, Samuel; JORET, Gwenaël.Operations research letters. 2012, Vol 40, Num 1, pp 31-35, issn 0167-6377, 5 p.Article

An approximation algorithm for the k-Level Concentrator Location ProblemDREXL, Moritz A.Operations research letters. 2011, Vol 39, Num 5, pp 355-358, issn 0167-6377, 4 p.Article

Improved Approximation Algorithms for Label Cover ProblemsCHARIKAR, Moses; HAJIAGHAYI, Mohammadtaghi; KARLOFF, Howard et al.Algorithmica. 2011, Vol 61, Num 1, pp 190-206, issn 0178-4617, 17 p.Article

Approximation, randomization, and combinatorial optimization (algorithms and techniques)Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-38044-2, 1Vol, XII-522 p, isbn 3-540-38044-2Conference Proceedings

Approximation Scheme for Lowest Outdegree Orientation and Graph Density MeasuresKOWALIK, Lukasz.Lecture notes in computer science. 2006, pp 557-566, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

Is constraint satisfaction over two variables always easy?ENGEBRETSEN, Lars; GURUSWAMI, Venkatesan.Lecture notes in computer science. 2002, pp 224-238, issn 0302-9743, isbn 3-540-44147-6, 15 p.Conference Paper

Approximation algorithms for spreading pointsCABELLO, Sergio.Journal of algorithms (Print). 2007, Vol 62, Num 2, pp 49-73, issn 0196-6774, 25 p.Article

Approximation algorithms for capacitated rectangle stabbingEVEN, Guy; RAWITZ, Dror; SHAHAR, Shimon et al.Lecture notes in computer science. 2006, pp 18-29, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

Approximate guarding of monotone and rectilinear polygonsNILSSON, Bengt J.Lecture notes in computer science. 2005, pp 1362-1373, issn 0302-9743, isbn 3-540-27580-0, 12 p.Conference Paper

Fast algorithms for approximately counting mismatchesKARLOFF, H.Information processing letters. 1993, Vol 48, Num 2, pp 53-60, issn 0020-0190Article

A (2 - c log N/N): Approximation algorithm for the stable marriage problemIWAMA, Kazuo; MIYAZAKI, Shuichi; OKAMOTO, Kazuya et al.Lecture notes in computer science. 2004, pp 349-361, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

Parameterized complexity: The main ideas and connections to practical computingFELLOWS, Michael R.Lecture notes in computer science. 2002, pp 51-77, issn 0302-9743, isbn 3-540-00346-0, 27 p.Conference Paper